On Computing the Convex Hull of (Piecewise) Curved Objects
نویسندگان
چکیده
We utilize support functions to transform the problem of constructing the convex hull of a finite set of curved objects into the problem of computing the upper envelope of piecewise linear functions. This approach is particularly suited if the objects are (possibly intersecting) circular arcs in the plane. Mathematics Subject Classification (2000). Primary 68U05; Secondary 65D18.
منابع مشابه
On Computing the Convex Hull of (Piecewise) Spherical Objects
We utilize support functions to transform the problem of constructing the convex hull of a finite set of spherical objects into the problem of computing the upper envelope of piecewise linear functions. This approach is particularly suited if the objects are (possibly intersecting) circular arcs in the plane or spheres in three-space.
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملLet Them Fall Where They May: Capture Regions of Curved Objects and Polyhedra
When a three dimensional object is placed in contact with a supporting plane, gravitational forces move it to one of a nite set of stable poses. For each stable pose, there is a region in the part's connguration space called a capture region; for any initial connguration within the region, the object is guaranteed to converge to that pose. The problem of computing maximal capture regions from a...
متن کاملConvexhull of Curved Objects via Duality { a General Framework and an Optimal 2-d Algorithm
We address the problem of nding the convex hull of curved polyhedra in Euclidean spaces of nite dimension. Optimal algorithms for simple curved polygons in E 2 exist but the more general version of this problem seems missing from the literature. A precise deenition of the objects under consideration is given. It encompasses most interesting solids that could arise in practical applications of g...
متن کاملOn the Convex Hulls of Parametric Plane Curves
Linear-time convex hull algorithms are known to exist for polygons and planar objects bounded by piecewise algebraic curves. Most of the existing algorithms laboriously trace out the so-called “pockets” formed by the concave portions of an object’s boundary. Objects bounded by general parametric curves have been excluded from the previous study partly because the nature of computation is seemin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics in Computer Science
دوره 6 شماره
صفحات -
تاریخ انتشار 2012